An Efficient Algorithm for 2-Dimensional Pattern Matching Problem
نویسندگان
چکیده
منابع مشابه
An efficient algorithm for the blocked pattern matching problem
MOTIVATION Tandem mass spectrometry (MS) has become the method of choice for protein identification and quantification. In the era of big data biology, tandem mass spectra are often searched against huge protein databases generated from genomes or RNA-Seq data for peptide identification. However, most existing tools for MS-based peptide identification compare a tandem mass spectrum against all ...
متن کاملAn Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملI/O Efficient Algorithm for Graph Pattern Matching Problem
Graph pattern matching problem is a problem to find the patterns in a large data graph [1] that match a user-given graph pattern. It is one of the most profound areas of computer science. Because of it’s widely applications, it is a very active area with intensive researches for many years. It is based on graph or subgraph isomorphism. The graph isomorphism problem [2] is the problem of determi...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملAn Efficient Approximation Algorithm for Point Pattern Matching Under Noise
Point pattern matching problems are of fundamental importance in various areas including computer vision and structural bioinformatics. In this paper, we study one of the more general problems, known as LCP (largest common point set problem): Let P and Q be two point sets in R, and let ǫ ≥ 0 be a tolerance parameter, the problem is to find a rigid motion μ that maximizes the cardinality of subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of KONBiN
سال: 2020
ISSN: 2083-4608
DOI: 10.2478/jok-2020-0041